Why Machines Cannot be
نویسنده
چکیده
Mental processes are abstracted from a subset of the physical universe ; these, in turn, lead to the world of ideas. Although these ideas include quantum logic, no credible way has yet been found that constructs machines which use superimposed possibilities in the style of quantum logic, more general in computing power to machines based on classical logic. Machine theories are based exclusively on classical logic and so-called \quantum computers" are equivalent, computationally, to classical computers. A machine cannot be conscious because it can only respond according to a predetermined program. Viewed as a machine, there is no explanation for the binding of the patterns in the brain. Neither are current machines matched to the rhythms of the universe which would endow them with the capacity to reorganize to the changing environment. This compels us to the view that machine models of the brain based on classical logic are inadequate. Summary This paper considers some limitations of machines in performing \conscious" or \intelligent" tasks. I do not attempt to deene consciousness; rather, I consider a behavioral approach where \consciousness" is associated with reorganization| with respect not only to physical processes but also information signals. The reorganization of the brain connections leads to an inner environment that continually adjusts to the external environment. Is it this style that leads to the astonishing generalization ability of biological organisms? It is evident that this
منابع مشابه
A fixed and flexible maintenance operations planning optimization in a parallel batch machines manufacturing system
Scheduling has become an attractive area for artificial intelligence researchers. On other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. A maintenance program may be considered as the heath care of manufacturing machines and equipments...
متن کاملNew Models of Computation
This paper examines the limitations of Turing Machines as a complete model of computation, and presents several models that extend Turing Machines. Dynamic interaction of clients and servers on the Internet, an infinite adaptation from evolutionary computation, and robots sensing and acting are some examples of areas that cannot be properly described using Turing Machines and algorithms. They r...
متن کاملHow Artificial is Intelligence in AI? Arguments for a Non-Discriminatory Turing Test
Friedrich von Hayek’s The Sensory Order (1952) presents a physicalist identity theory of the human mind. In a reaction to Karl Popper’s criticism that such a “causal” theory of the mind cannot explain the descriptive and critical-argumentative functions of language, Hayek wrote a paper that was never published. It contains the description of a thought experiment of two communicating automata. T...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...
متن کامل